Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

Weibull型产品的可靠性验证

讨论了Weibull型产品的可靠性验证问题 ,首先分析了Weibull型产品分布参数的无信息验前分布问题 ,利用验前信息可以得到分布参数的验前概率密度函数 ,进而分析了产品的可靠性验证问题 ,顾及了使用方利益和生产方利益。仿真算例表明 ,使用方利益和生产方利益是相互折衷的。     

面向 MPP Fortran 的程序自动并行化初探

ＭＰＰＦｏｒｔｒａｎ是由Ｃｒａｙ公司推出的一种较有代表性的数据并行语言,本文首先介绍了ＭＰＰＦｏｒｔｒａｎ的主要特点,然后,以该语言为例,对面向ＭＰＰ系统程序自动并行化的主要内容进行了初步的探讨。     

汽车空调制冷系统的优化分布原则研究

本文结合汽车空调系统的装修实践,以热舒适条件为评判标准,根据空调制冷系统的性能计算和车箱热载荷计算,提出了汽车空调制冷系统的选用依据及其优化分布的若干基本原则。     

恒加试验的最优线性不变估计

给出了恒加试验的最优线性无偏估计与最优线性不变估计。与有关文献给出的二步估计相比,这两个估计有较大改进,并且在计算上简单可行。     

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

建设可视化高清消防应急网络指挥系统可行性分析

针对年初特大冰冻和“汶川”特大地震两次灾害的情况，结合消防指挥系统建设，对建设可视化高清消防网络指挥系统可行性进行分析。     

Hopfield神经网络的防空火力最优分配问题

火力的最优分配是作战计划的重要内容,它包含火力单位特性、目标单位特性、最优准则、射击条件四个方面的内容。简要介绍了Hopfield神经网络的基础知识,建立了防空自动化指挥系统中火力分配的Hopfield神经网络算法一般模型,在此基础上,阐述了利用该算法在火力分配中的一般应用,并通过在计算机上借助C语言编程实现了这一模型,得出了一种比较合理可行的火力分配方案。     

基于0-1规划的弹种决策与发射时序优化

对于身管发射武器系统,同一发射单元使用不同弹种完成作战任务时,需要确立合适的弹种决策与最佳的发射时机.提出用O-1变量来描述弹种决策变量.通过时弹种发射机制及武器系统控制特点进行分析,构造多种0-1变量用以描述武器系统作战时序之间的约束关系,建立了弹种发射时序的0-1规划模型,并用LINGO软件实现了0-1规划的求解.给出了典型应用实例,进行了仿真计算,结果表明,该方法简单可行.     

基于邻域灰度分布的IR弱小目标检测

图像中邻域内灰度起伏程度越大 ,各点灰度值占邻域内总灰度值的比率的平方和越大 ,由此提出了一种基于邻域灰度分布的弱小目标检测方法。同时考虑到复杂自然背景 ,特别是背景中含有大量边缘和高频点的情况 ,提出了目标检测的改进方法。最后 ,利用邻域判决法实现运动目标的进一步分离。实验表明该方法能够极大地减少候选目标点数 ,准确有效地检测复杂自然背景中的红外运动弱小目标 ,适合于实时和多目标的检测